Efficient Load-Balancing Aware Cloud Resource Scheduling for Mobile User
نویسندگان
چکیده
منابع مشابه
Hybrid Scheduling Algorithm for Efficient Load Balancing In Cloud Computing
Navpreet Singh M. tech Scholar, CSE & IT Deptt., BBSB Engineering College, Fatehgarh Sahib, Punjab, India (IKG Punjab Technical University, Jalandhar) [email protected] Dr. Kanwalvir Singh Dhindsa Professor, CSE & IT Deptt., BBSB Engineering College, Fatehgarh Sahib, Punjab, India (IKG Punjab Technical University, Jalandhar) [email protected] ---------------------------------...
متن کاملAn Energy-aware Class-based Load Balancing Model for Resource Management in Cloud Computing
Cloud Computing is a model for enabling ubiquitous and on-demand access to shared resource pool. It represents a paradigm shift from traditional personal computing to computing as a pay-per-use utility. Cloud Computing is not without its challenges and despite tremendous progress in recent years, issues relating to security, resource provisioning and high availability still continue to plague i...
متن کاملEfficient Load Balancing Algorithm in Cloud Environment
Load balancing is the process of distributing the load among various nodes of a distributed system to improve both resource utilization and job response time while also avoiding a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. This paper presents an approach for scheduling algorithms that can maintain the load balancing and provides be...
متن کاملCloud Task Scheduling for Load Balancing based on Intelligent Strategy
Cloud computing is a type of parallel and distributed system consisting of a collection of interconnected and virtual computers. With the increasing demand and benefits of cloud computing infrastructure, different computing can be performed on cloud environment. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization prob...
متن کاملEfficient, Proximity-Aware Load Balancing for Structured P2P Systems
Structured peer-to-peer (P2P) systems address the load balancing issue in a rather naive way, by simply resorting to the uniformity of the hash function utilized to generate object IDs. Such a random choice of object IDs could result in O(logN) load imbalance. In this position paper, we propose an efficient, proximity-aware load balancing algorithm for such systems. To our knowledge, this is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2017
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxx037